A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering

نویسندگان

چکیده

In real-world scenarios, identifying the optimal number of clusters in a dataset is difficult task due to insufficient knowledge. Therefore, indispensability sophisticated automatic clustering algorithms for this purpose has been contemplated by some researchers. Several assisted quantum-inspired metaheuristics have developed recent years. However, literature lacks definitive documentation state-of-the-art metaheuristic automatically datasets. This article presents brief overview process establish importance making automatic. The fundamental concepts quantum computing paradigm are also presented highlight utility algorithms. thoroughly analyses employed address various reviewed were classified according their main sources inspiration. addition, representative works each classification chosen from existing works. Thirty-six such prominent further critically analysed based on aims, used mechanisms, data specifications, merits and demerits. Comparative results performance computational time analyse As such, promises provide detailed analysis algorithms, while highlighting

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Review: Metaheuristic Search-Based Fuzzy Clustering Algorithms

Fuzzy clustering is a famous unsupervised learning method used to collecting similar data elements within cluster according to some similarity measurement. But, clustering algorithms suffer from some drawbacks. Among the main weakness including, selecting the initial cluster centres and the appropriate clusters number is normally unknown. These weaknesses are considered the most challenging tas...

متن کامل

A stochastic nature inspired metaheuristic for clustering analysis

This paper presents a new stochastic nature inspired methodology, which is based on the concepts of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), for optimally clustering N objects into K clusters. Due to the nature of stochastic and population-based search, the proposed algorithm can overcome the drawbacks of traditional clustering methods. Its performance is compared wi...

متن کامل

Comparison of Nature Inspired Metaheuristic Algorithms

Metaheuristics is basically a higher level procedure, which generates a simpler procedure to solve an optimization problem. Optimization is the process of adjusting the inputs to or characteristics of a device, mathematical process, or experiment to find the minimum or maximum output or result. The input consists of variables; the process or function is known as the cost function, objective fun...

متن کامل

Metaheuristic Optimization: Nature-Inspired Algorithms and Applications

Turing’s pioneer work in heuristic search has inspired many generations of research in heuristic algorithms. In the last two decades, metaheuristic algorithms have attracted strong attention in scientific communities with significant developments, especially in areas concerning swarm intelligence based algorithms. In this work, we will briefly review some of the important achievements in metahe...

متن کامل

Using Metaheuristic Algorithms Combined with Clustering Approach to Solve a Sustainable Waste Collection Problem

Sustainability is a monumental issue that should be considered in designing a logistics system. In order to incorporate sustainability concepts in our study, a waste collection problem with economic, environmental, and social objective functions was addressed. The first objective function minimized overall costs of the system, including establishment of depots and treatment facilities. Addressi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11092018